Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles

We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support greedy routing with delivery guarantee in wireless ad hoc sensor networks. The main assets of HBR are: 1) packet delivery guarantee, 2) unique virtual addressing, 3) no packet overhead in typical cases, 4) small routing tables, 5) no physical geographic coordinates necessary, 6) easy to combine with energy-aware approaches, and 7) simplicity. We evaluate the performance of HBR using realistic network topologies. We combine HBR with two energy-aware geographic greedy routing algorithms based on physical coordinates and virtual coordinates, re-